Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ct.\*:("Logic and foundations")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3982

  • Page / 160
Export

Selection :

  • and

Towards a descriptive set theory for domain-like structuresSELIVANOV, Victor L.Theoretical computer science. 2006, Vol 365, Num 3, pp 258-282, issn 0304-3975, 25 p.Conference Paper

From fuzzy logic to fuzzy mathematics : A methodological manifestoBEHOUNEK, Libor; CINTULA, Petr.Fuzzy sets and systems. 2006, Vol 157, Num 5, pp 642-646, issn 0165-0114, 5 p.Article

Reasoning with power defaultsZHANG, Guo-Qiang; ROUNDS, William C.Theoretical computer science. 2004, Vol 323, Num 1-3, pp 321-350, issn 0304-3975, 30 p.Article

Consequences of an exotic definition for P = NPDA COSTA, N. C. A; DORIA, F. A.Applied mathematics and computation. 2003, Vol 145, Num 2-3, pp 655-665, issn 0096-3003, 11 p.Article

Interaction nets for linear logicMACKIE, Ian.Theoretical computer science. 2000, Vol 247, Num 1-2, pp 83-140, issn 0304-3975Article

Towards an algebraic theory of typed mobile processesYUXIN DENG; SANGIORGI, Davide.Theoretical computer science. 2006, Vol 350, Num 2-3, pp 188-212, issn 0304-3975, 25 p.Conference Paper

Working with ARMs: complexity results on atomic representations of Herbrand modelsGOTTLOB, Georg; PICHLER, Reinhard.Information and computation (Print). 2001, Vol 165, Num 2, pp 183-207, issn 0890-5401Article

Connection methods in linear logic and proof nets constructionGALMICHE, D.Theoretical computer science. 2000, Vol 232, Num 1-2, pp 231-272, issn 0304-3975Article

Complexity of categorical theories with computable modelsGONCHAROV, S. S. S; KHUSAINOV, B. Kh.Doklady. Mathematics. 2002, Vol 66, Num 1, pp 52-54, issn 1064-5624Article

Cercles vicieux, mathématiques et formalisations logiques = Vicious circles, mathematics and logicLONGO, Giuseppe.Mathématiques et sciences humaines (2000). 2000, Num 152, pp 5-26, issn 0987-6936Article

Fuzzy logics as the logics of chainsBEHOUNEK, Libor; CINTULA, Petr.Fuzzy sets and systems. 2006, Vol 157, Num 5, pp 604-610, issn 0165-0114, 7 p.Article

Proving Behavioral Refinements of COL-specificationsBIDOIT, Michel; HENNICKER, Rolf.Algebra, meaning, and computation (essays dedicated to Joseph A. Goguen on the occasion of his 65th birthday). Lecture notes in computer science. 2006, pp 333-354, issn 0302-9743, isbn 3-540-35462-X, 1Vol, 22 p.Book Chapter

On categorical equivalence of Gentzen-style derivations in IMLLSOLOVIEV, Sergei; OREVKOV, Vladimir.Theoretical computer science. 2003, Vol 303, Num 1, pp 245-260, issn 0304-3975, 16 p.Conference Paper

A nonadaptive NC checker for permutation group intersectionARVIND, V; TORAN, Jacobo.Theoretical computer science. 2001, Vol 259, Num 1-2, pp 597-611, issn 0304-3975Article

An induction principle for pure type systemsBARTHE, Gilles; HATCLIFF, John; SØRENSEN, Morten Heine B et al.Theoretical computer science. 2001, Vol 266, Num 1-2, pp 773-818, issn 0304-3975Article

L'automorphisme de Frobenius des vecteurs de Witt = The Frobenius automorphism of Witt vectorsBELAIR, Luc; MACINTYRE, Angus.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 2000, Vol 331, Num 1, pp 1-4, issn 0764-4442Article

Correspondences between classical, intuitionistic and uniform provabilityNADATHUR, G.Theoretical computer science. 2000, Vol 232, Num 1-2, pp 273-298, issn 0304-3975Article

A Gentzen-style sequent calculus of constructions with expansion rulesSELDIN, J. P.Theoretical computer science. 2000, Vol 243, Num 1-2, pp 199-215, issn 0304-3975Article

Formalizing mathematics in higher-order logic : a case study in geometric modellingPUITG, F; DUFOURD, J.-F.Theoretical computer science. 2000, Vol 234, Num 1-2, pp 1-57, issn 0304-3975Article

The expressive power of finitely many generalized quantifiersANUJ DAWAR; HELLA, L.Information and computation (Print). 1995, Vol 123, Num 2, pp 172-184, issn 0890-5401Article

Extensions of F≤ with decidable typingVorobyov, Sergei.1994, 29 p.Report

Which logic is the real fuzzy logic?NOVAK, Vilém.Fuzzy sets and systems. 2006, Vol 157, Num 5, pp 635-641, issn 0165-0114, 7 p.Article

On the complexity of the reflected logic of proofsKRUPSKI, Nikolai V.Theoretical computer science. 2006, Vol 357, Num 1-3, pp 136-142, issn 0304-3975, 7 p.Conference Paper

Σn-bounding and Δn-inductionSLAMAN, Theodore A.Proceedings of the American Mathematical Society. 2004, Vol 132, Num 8, pp 2449-2456, issn 0002-9939, 8 p.Article

Une axiomatisation de la substitution = Axiomatisation of substitutionCRABBE, Marcel.Comptes rendus. Mathématique. 2004, Vol 338, Num 6, pp 433-436, issn 1631-073X, 4 p.Article

  • Page / 160